Specifying an Automated Induction

نویسندگان

  • Dimitri Naidich
  • T. B. Dinesh
چکیده

We describe the implementation of an automated theorem pro-ver for algebraic speciications, in an algebraic speciication setting using the ASF+SDF Meta-environment. The current implementation is based on the implicit induction approach implemented in SPIKE 1, 2]. We consider the implementation as a case study on the tool generation within ASF+SDF which also provides an experimental basis for the research on automated induction. We consider the issues of the simpliication strategies of implicit induction, the user interaction/heuristics in implicit induction, the computational eeec-tiveness of ASF+SDF speciications, and the plausible improvements of the ASF+SDF speciication language.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Framework for Inductive Proofs of Data Structures

We consider the problem of automated program verification with emphasis on reasoning about dynamically manipulated data structures. We begin with an existing specification language which has two key features: (a) the use of explicit heap variables, and (b) user defined recursive properties in a wrapper logic language. The language provides a new-level of expressiveness for specifying properties...

متن کامل

Encoding Induction in Correctness Proofs of Program Transformations as a Termination Problem∗

The diagram-based method to prove correctness of program transformations consists of computing complete set of (forking and commuting) diagrams, acting on sequences of standard reductions and program transformations. In many cases, the only missing step for proving correctness of a program transformation is to show the termination of the rearrangement of the sequences. Therefore we encode compl...

متن کامل

Specifying and Verifying Organizational Security Properties in First-Order Logic

In certain critical cases the data flow between business departments in banking organizations has to respect security policies known as Chinese Wall or Bell–La Padula. We show that these policies can be represented by formal requirements and constraints in first-order logic. By additionally providing a formal model for the flow of data between business departments we demonstrate how security po...

متن کامل

A Heuristic for SKU Assignment and Allocation in an A-Frame System

With the need for extremely high accuracy in pharmaceutical distribution, automated technologies are standard for order fulfillment and specifying the automated system that best meets storage and throughput constraints is a complex process. This research provides a heuristic to address the issues related to SKU assignment and allocation in the most common automated order picking system, an A-fr...

متن کامل

Application of the rule extraction method to evaluate seismicity of Iran

Assessing seismic hazards involves specifying the likelihood, magnitude and location of earthquakes in a region. Predicting the seismic hazards is the first step in reducing the impact of the damage caused by an earthquake.  In this study, to fully utilize all the known parameters which may possibly affect the occurrence of earthquakes (mb ≥ 4.5); a data-driven rule-extraction method called the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995